Sidon Sets in N
نویسنده
چکیده
We study finite and infinite Sidon sets in N. The additive energy of two sets is used to obtain new upper bounds for the cardinalities of finite Sidon subsets of some sets as well as to provide short proofs of already known results. We also disprove a conjecture of Lindstrom on the largest Sidon set in [1, N ]× [1, N ] and relate it to a known conjecture of Vinogradov concerning the size of the smallest quadratic residue modulo a prime p. For infinite Sidon sets A ⊂ N, we prove that lim infn→∞ |A∩[1,n] d| √ nd/ log n > 0. Finally, we show how to map infinite Sidon sets in N to N ′ in an effective way. As an application, we find an explicit Sidon set A such that A(n) ≥ n.
منابع مشابه
Results on Sidon and B h Sequences
Results on Sidon and Bh Sequences Sangjune Lee A set A of non-negative integers is a Sidon set if all the sums a1 + a2, with a1 ≤ a2 and a1, a2 ∈ A, are distinct. In this dissertation, we deal with results on the number of Sidon sets in [n] = {0, 1, · · · , n − 1} and the maximum size of Sidon sets in sparse random subsets of [n] or N (the set of natural numbers). We also consider a natural gen...
متن کاملComparisons of Sidon and I0 Sets
(1) Bd(E) and B(E) are isometrically isomorphic for finite E ⊂ Γ. Bd(E) = `∞(E) characterizes I0 sets E and B(E) = `∞(E) characterizes Sidon sets E. [In general, Sidon sets are distinct from I0 sets. Within the group of integers Z, the set {2}n ⋃ {2+n}n is helsonian (hence Sidon) but not I0.] (2) Both are Fσ in 2 (as is also the class of finite unions of I0 sets). (3) There is an analogue for I...
متن کاملProportions of Sidon Sets Are I0 Subsets
It is proved that proportions of Sidon sets are I0 subsets of controlled degree. That is, a set E is Sidon if and only if, there are r > 0 and positive integer n such that, for every finite subset F ⊂ E, there is H ⊂ F with the cardinality of H at least r times the cardinality of F and N(H) ≤ n (N(H) is a measure of the degree of being I0). This paper leaves open David Grow’s question of whethe...
متن کاملOn Partitioning Sidon Sets with Quasi-independent Sets
There is a construction of random subsets of Z in which almost every subset is Sidon (this was first done by Katznelson). More is true: almost every subset is the finite union of quasi-independent sets. Also, if every Sidon subset of Z\{0} is the finite union of quasi-independent sets, then the required number of quasi-independent sets is bounded by a function of the Sidon constant. Analogs of ...
متن کاملSidon Sets in Groups and Induced Subgraphs of Cayley Graphs
Let S be a subset of a group G. We call S a Sidon subset of the first (second) kind, if for any x, y, Z, WE S of which at least 3 are different, xy ~ ZW (xy I "" zwI , resp.). (For abelian groups, the two notions coincide.) If a has a Sidon subset of the second kind with n elements then every n-vertex graph is an induced subgraph of some Cayley graph of G. We prove that a sufficient condition f...
متن کامل